package com.wfm.leetcode.editor.cn;

import java.util.PriorityQueue;

/**
 * 直方图的水量
 * 2024-04-08 14:57:28
 */
class VolumeOfHistogramLcci {

//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int trap(int[] height) {
        return 0;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

    public static void main(String[] args) {
        Solution solution = new VolumeOfHistogramLcci().new Solution();
        PriorityQueue<Integer> p = new PriorityQueue<>((a,b)->(b-a));
        p.add(1);
        p.add(5);
        p.add(2);
        Integer poll = p.poll();
        System.out.println(poll);
        Integer poll1 = p.poll();
        System.out.println(poll1);
        Integer poll2 = p.poll();
        System.out.println(poll2);
    }
}
